Comparing Non-Linear Regression Methods on Black-Box Optimization Benchmarks
نویسندگان
چکیده
The paper compares several non-linear regression methods on synthetic data sets generated using standard benchmarks for continuous black-box optimization. For that comparison, we have chosen regression methods that have been used as surrogate models in such optimization: radial basis function networks, Gaussian processes, and random forests. Because the purpose of black-box optimization is frequently some kind of design of experiments, and because a role similar to surrogate models is in the traditional design of experiments played by response surface models, we also include standard response surface models, i.e., polynomial regression. The methods are evaluated based on their mean-squared error and on the Kendall’s rank correlation coefficient between the ordering of function values according to the model and according to the function used to generate the data.
منابع مشابه
Auction optimization using regression trees and linear models as integer programs
One of the difficulties in solving multiagent optimization problems is to construct an optimization algorithm describing the properties of a multiagent system that may be unknown to a centralized decision maker. For instance, in a sequential resource allocation problem with multiple buyer agents, it is highly challenging for the seller to decide on an optimal ordering of the resources to sell t...
متن کاملOptimal Black-Box Reductions Between Optimization Objectives
The diverse world of machine learning applications has given rise to a plethora of algorithms and optimization methods, finely tuned to the specific regression or classification task at hand. We reduce the complexity of algorithm design for machine learning by reductions: we develop reductions that take a method developed for one setting and apply it to the entire spectrum of smoothness and str...
متن کاملBlack-box Landscapes: Characterization, Optimization, Sampling, and Application to Geometric Configuration Problems
In many areas of science and engineering researchers consider systems that can be solely examined by their input and output characteristics without any knowledge of their internal workings. Such black-box systems are the topic of the present thesis. In many practical cases, a black box comprises a complex mathematical model, a computer simulation, a real-world experiment, or a combination of an...
متن کاملEnergy Landscapes of Atomic Clusters as Black Box Optimization Benchmarks
We present the energy minimization of atomic clusters as a promising problem class for continuous black box optimization benchmarks. Finding the arrangement of atoms that minimizes a given potential energy is a specific instance of the more general class of geometry optimization or packing problems, which are generally NP-complete. Atomic clusters are a well-studied subject in physics and chemi...
متن کاملAdvancing Bayesian Optimization: The Mixed-Global-Local (MGL) Kernel and Length-Scale Cool Down
Bayesian Optimization (BO) has become a core method for solving expensive black-box optimization problems. While much research focussed on the choice of the acquisition function, we focus on online length-scale adaption and the choice of kernel function. Instead of choosing hyperparameters in view of maximum likelihood on past data, we propose to use the acquisition function to decide on hyperp...
متن کامل